The Generating Function for Total Displacement

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Generating Function for Total Displacement

In a 1977 paper, Diaconis and Graham studied what Knuth calls the total displacement of a permutation w, which is the sum of the distances |w(i)−i|. In recent work of the first author and Tenner, this statistic appears as twice the type An−1 version of a statistic for Coxeter groups called the depth of w. There are various enumerative results for this statistic in the work of Diaconis and Graha...

متن کامل

A Mthod for Generating the Turbulent Intermittency Function

A detection method based on sensitization of a squared double differentiated signal is developed which discriminates the turbulent zones from laminar zones quite accurately. The procedure adopts a variable threshold and a variable hold time of the order of the Kolmogorov time scale. The output file so generated, includes all the information for further analysis of the turbulent signal.

متن کامل

Generating Functions for the Number of Permutations with Limited Displacement

Let V (d, n) be the number of permutations p of {1, 2, . . . , n} that satisfy |pi−i| 6 d for all i. Generating functions for V (d, n), for fixed d, are given.

متن کامل

The IUFP Algorithm for Generating Simulation Heart

In all systems simulation, random variates are considered as a main factor and based of simulation heart. Actually, randomization is inducted by random variates in the simulation. Due to the importance of such a problem, a new method for generation of random variates from continuous distributions is presented in this paper. The proposed algorithm, called uniform fractional part (UFP) is simpler...

متن کامل

Congruences for Han’s Generating Function

For an integer t ≥ 1 and a partition λ, we let Ht(λ) be the multiset of hook lengths of λ which are divisible by t. Then, define aeven t (n) and aodd t (n) to be the number of partitions of n such that |Ht(λ)| is even or odd, respectively. In a recent paper, Han generalized the Nekrasov-Okounkov formula to obtain a generating function for at(n) = aeven t (n)− aodd t (n). We use this generating ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2014

ISSN: 1077-8926

DOI: 10.37236/4329